Stein ’ s Method Proof of the Asymptotic Normality of Descents and Inversions in the Symmetric Group By Jason
نویسنده
چکیده
Let W (π) be either the number of descents or inversions of a permutation π ∈ Sn. Stein’s method is applied to bound the sup-norm distance between the distribution of W and the standard normal distribution. This appears to be the first use of Stein’s method in theory of permutation statistics. The construction of an exchangeable pair (W,W ) used in Stein’s method is non-trivial and may be of independent interest.
منابع مشابه
A Stein ' s Method Proof of the Asymptotic Normality of Descents and Inversions in theSymmetric
Let W ( ) be either the number of descents or inversions of a permutation 2 Sn. Stein's method is applied to bound the sup-norm distance between the distribution of W and the standard normal distribution. This appears to be the rst use of Stein's method in theory of permutation statistics. The construction of an exchangeable pair (W;W 0) used in Stein's method is non-trivial and may be of indep...
متن کاملThe Distribution of Descents in Fixed Conjugacy Classes of the Symmetric
The distribution of descents in a xed conjugacy class of Sn is studied and it is shown that its moments have a remarkable property. This is proven two ways: one way via generating functions and another way via a combinatorial algorithm. This leads to an asymptotic normality theorem for the number of descents and major index in conjugacy classes of Sn with large cycles. 3
متن کاملSome Asymptotic Results of Kernel Density Estimator in Length-Biased Sampling
In this paper, we prove the strong uniform consistency and asymptotic normality of the kernel density estimator proposed by Jones [12] for length-biased data.The approach is based on the invariance principle for the empirical processes proved by Horváth [10]. All simulations are drawn for different cases to demonstrate both, consistency and asymptotic normality and the method is illustrated by ...
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملConvergence Rates for Generalized Descents
d -descents are permutation statistics that generalize the notions of descents and inversions. It is known that the distribution of d -descents of permutations of length n satisfies a central limit theorem as n goes to infinity. We provide an explicit formula for the mean and variance of these statistics and obtain bounds on the rate of convergence using Stein’s method. Introduction For π ∈ Sn,...
متن کامل